A Delayed Size-reduction Technique for Speeding Up the LLL Algorithm
نویسندگان
چکیده
In this paper, we present a delayed size-reduction technique for speeding up the LLL algorithm. It can significantly speed up the LLL algorithm without sacrificing the quality of the results. Our experiments have shown that for problems of size 80, our algorithm can be twice as fast as the LLL algorithm. For larger size problems, the speed up is greater. Moreover, our algorithm provides a starting point for parallel LLL algorithms.
منابع مشابه
LLL reducing with the most significant bits March 27 , 2015
Let B be a basis of a Euclidean lattice, and B̃ an approximation thereof. We give a sufficient condition on the closeness between B̃ and B so that an LLL-reducing transformation U for B̃ remains valid for B. Further, we analyse an efficient reduction algorithm when B is itself a small deformation of an LLL-reduced basis. Applications include speeding-up reduction by keeping only the most significa...
متن کاملSegment and Strong Segment LLL-Reduction of Lattice Bases
We present an efficient variant of LLL-reduction of lattice bases in the sense of Lenstra, Lenstra, Lovász [LLL82]. We organize LLL-reduction in segments of size k. Local LLL-reduction of segments is done using local coordinates of dimension 2k. Strong segment LLL-reduction yields bases of the same quality as LLL-reduction but the reduction is n-times faster for lattices of dimension n. We exte...
متن کاملRounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences
In a seminal work at EUROCRYPT '96, Coppersmith showed how to nd all small roots of a univariate polynomial congruence in polynomial time: this has found many applications in public-key cryptanalysis and in a few security proofs. However, the running time of the algorithm is a high-degree polynomial, which limits experiments: the bottleneck is an LLL reduction of a high-dimensional matrix with ...
متن کاملA modified LLL algorithm for change of ordering of Grobner basis
In this paper, a modied version of LLL algorithm, which is a an algorithm with output-sensitivecomplexity, is presented to convert a given Grobner basis with respect to a specic order of a polynomialideal I in arbitrary dimensions to a Grobner basis of I with respect to another term order.Also a comparison with the FGLM conversion and Buchberger method is considered.
متن کاملVariants of the LLL Algorithm in Digital Communications: Complexity Analysis and Fixed-Complexity Implementation
The Lenstra-Lenstra-Lovász (LLL) algorithm is the most practical lattice reduction algorithm in digital communications. In this paper, several variants of the LLL algorithm with either lower theoretic complexity or fixed-complexity implementation are proposed and/or analyzed. Firstly, the O(n log n) theoretic average complexity of the standard LLL algorithm under the model of i.i.d. complex nor...
متن کامل